def main():
num_of_tests = int(input())
pairs = list(map(int, input().split()))
pairs.append(pairs[len(pairs)-2])
pair = []
for i in range (0, len(pairs)-1):
first = pairs[i]
sec = pairs[i + 1]
pair.append([first,sec])
try:
for i in pair:
for j in pair:
j.sort()
x1 = i[0]
x2 = i[1]
x3 = j[0]
x4 = j[1]
if x1 < x3 and x3 < x2 and x2 < x4:
print('yes')
exit()
elif x3 < x1 and x1 < x4 and x4 < x2:
print('yes')
exit()
print('no')
except IndexError:
print('no')
exit()
main()#include <bits/stdc++.h>
using namespace std;
const int ss = 1e3;
#define x1 v[i]
#define x2 v[i + 1]
#define x3 v[j]
#define x4 v[j + 1]
int main() {
int n;
cin >> n;
if (n <= 2) {
cout << "no";
return 0;
}
int v[ss];
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n - 1; ++i) {
for (int j = 0; j < n - 1; ++j) {
if (i == j)
continue;
if ((x3 > x1 and x3 < x2 and x4 > x2) or
(x4 > x1 and x4 < x2 and x3 > x2) or
(x3 > x2 and x3 < x1 and x4 > x1) or
(x4 > x2 and x4 < x1 and x3 > x1)) {
cout << "yes";
return 0;
}
}
}
cout << "no";
return 0;
}1331B - Limericks | 305B - Continued Fractions |
1165B - Polycarp Training | 1646C - Factorials and Powers of Two |
596A - Wilbur and Swimming Pool | 1462B - Last Year's Substring |
1608B - Build the Permutation | 1505A - Is it rated - 2 |
169A - Chores | 765A - Neverending competitions |
1303A - Erasing Zeroes | 1005B - Delete from the Left |
94A - Restoring Password | 1529B - Sifid and Strange Subsequences |
1455C - Ping-pong | 1644C - Increase Subarray Sums |
1433A - Boring Apartments | 1428B - Belted Rooms |
519B - A and B and Compilation Errors | 1152B - Neko Performs Cat Furrier Transform |
1411A - In-game Chat | 119A - Epic Game |
703A - Mishka and Game | 1504C - Balance the Bits |
988A - Diverse Team | 1312B - Bogosort |
1616B - Mirror in the String | 1660C - Get an Even String |
489B - BerSU Ball | 977C - Less or Equal |